Metric dimensions of minor excluded graphs and minor exclusion in groups

نویسندگان

  • Mikhail I. Ostrovskii
  • David Rosenthal
چکیده

An infinite graph Γ is minor excluded if there is a finite graph that is not a minor of Γ. We prove that minor excluded graphs have finite Assouad-Nagata dimension and study minor exclusion for Cayley graphs of finitely generated groups. Our main results and observations are: (1) minor exclusion is not a group property: it depends on the choice of generating set; (2) a group with one end has a generating set for which the Cayley graph is not minor excluded; (3) there are groups that are not minor excluded for any set of generators, like Z3; (4) minor exclusion is preserved under free products; and (5) virtually free groups are minor excluded for any choice of finite generating set.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Excluded-minor Characterization of Apex-outerplanar

The class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: K4 and K2,3. The class of graphs that contain a vertex whose removal leaves an outerplanar graph is also minor-closed. We provide the complete list of 57 excluded minors for this class.

متن کامل

Recent Excluded Minor Theorems for Graphs

A graph is a minor of another if the first can be obtained from a subgraph of the second by contracting edges. An excluded minor theorem describes the structure of graphs with no minor isomorphic to a prescribed set of graphs. Splitter theorems are tools for proving excluded minor theorems. We discuss splitter theorems for internally 4-connected graphs and for cyclically 5-connected cubic graph...

متن کامل

Grigni: [15] Approximate TSP in Graphs with Forbidden Minors

Given as input an edge-weighted graph, we analyze two algorithms for nding subgraphs with low total edge weight. The rst algorithm nds a separator subgraph with a small number of components, and is analyzed for graphs with an arbitrary excluded minor. The second algorithm nds a spanner with small stretch factor, and is analyzed for graphs in a hereditary family G(k). These results imply (i) a Q...

متن کامل

Graph minors and graphs on surfaces

Graph minors and the theory of graphs embedded in surfaces are fundamentally interconnected. Robertson and Seymour used graph minors to prove a generalization of the Kuratowski Theorem to arbitrary surfaces [37], while they also need surface embeddings in their Excluded Minor Theorem [45]. Various recent results related to graph minors and graphs on surfaces are presented.

متن کامل

The excluded minor structure theorem, and linkages in large graphs of bounded tree-width

At the core of the Robertson-Seymour theory of graph minors lies a powerful structure theorem which captures, for any fixed graph H, the common structural features of all the graphs not containing H as a minor. Robertson and Seymour prove several versions of this theorem, each stressing some particular aspects needed at a corresponding stage of the proof of the main result of their theory, the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IJAC

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2015